Loop problem in proteins: Developments on Monte Carlo simulated annealing approach

نویسندگان

  • Louis Carlacci
  • S. Walter Englander
چکیده

Calculations of loop segments in bovine pancreatic trypsin inhibitor starting from random conformations are more efficient, reproducible, and reliable due to several program enhancements. Monte Carlo simulated annealing (MCSA) calculations of a five-residue a-helix N-terminus segment (H5) and @-strand segment (B5) in this study are compared to the corresponding loop calculations in our previous study. Characteristics of the calculations are: the lowest final total energy conformations (LECs) are within 5 kcal/mol; the average backbone deviations of the computed segments from the native X-ray conformations are 0.43 -t 0.15 A for H5 and 0.68 -t 0.20 A for B5; and all the native backbone-backbone hydrogen bonds (H bonds) are present in the best LECs. Compared to the previous study, the H5 and B5 calculations are about 3 and 24 times more efficient, respectively. In the analysis of the best H5 simulated annealing run, backbone-backbone H bonds appear between RT = 4 and 70 kcal/mol, where RT is the Boltzmann temperature factor. H bonds that involve side chains appear in the RT = 1-10 kcal/mol range. Program enhancements implemented are varying main chain versus side chain dihedral angle selection rate, varying +/I,!J and xl/x2 dihedral angles in pairs, the use of main chain and side chain rotamer libraries, and varying the location of the segment origin.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Monte-Carlo Go Developments

We describe two Go programs, and , developed by a Monte-Carlo approach that is simpler than Bruegmann’s (1993) approach. Our method is based on Abramson (1990). We performed experiments to assess ideas on (1) progressive pruning, (2) all moves as first heuristic, (3) temperature, (4) simulated annealing, and (5) depth-two tree search within the Monte-Carlo framework. Progressive pruning and the...

متن کامل

Developments on Monte Carlo Go

We have developed two go programs, Olga and Oleg, using a Monte Carlo approach, simpler than Bruegmann’s [Bruegmann, 1993], and based on [Abramson, 1990]. We have set up experiments to assess ideas such as progressive pruning, transpositions, temperature, simulated annealing and depth-two tree search within the Monte Carlo framework. We have shown that progressive pruning alone gives better res...

متن کامل

Markov Chain Monte Carlo and Related Topics

This article provides a brief review of recent developments in Markov chain Monte Carlo methodology. The methods discussed include the standard Metropolis-Hastings algorithm, the Gibbs sampler, and various special cases of interest to practitioners. It also devotes a section on strategies for improving mixing rate of MCMC samplers, e.g., simulated tempering, parallel tempering, parameter expans...

متن کامل

Predict ion of Pept ide Conformat ion by Mult icanonical Algorithm : A New Approach to the Multiple - Minima Problem *

We apply a recently developed method, multicanonical algorithm, to the problem of tertiary structure prediction of peptides and proteins. As a simple example to test the effectiveness of the algorithm, Met-enkephalin is studied and the ergodicity problem, or multiple-minima problem, is shown to be overcome by this algorithm. The lowest-energy conformation obtained agrees with that determined by...

متن کامل

The loop problem in proteins: a Monte Carlo simulated annealing approach.

A Monte Carlo simulated annealing (MCSA) algorithm was used to generate the conformations of local regions in bovine pancreatic trypsin inhibitor (BPTI) starting from random initial conformations. In the approach explored, only the conformation of the segment is computed; the rest of the protein is fixed in the known native conformation. Rather than follow a single simulation exhaustively, comp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Journal of Computational Chemistry

دوره 17  شماره 

صفحات  -

تاریخ انتشار 1996